On Isomorphism and Canonization of Tournaments and Hypertournaments
نویسندگان
چکیده
We give a polynomial-time oracle algorithm for Tournament Canonization that accesses oracles for Tournament Isomorphism and Rigid-Tournament Canonization. Extending the Babai-Luks Tournament Canonization algorithm, we give an n n) algorithm for canonization and isomorphism testing of k-hypertournaments, where n is the number of vertices and k is the size of hyperedges.
منابع مشابه
3-connected Planar Graph Isomorphism is in Log-space
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a deterministic log-space algorithm for 3-connected planar graph isomorphism and canonization. This gives an L -completeness result, thereby settling its complexity. The algorithm uses the notion of universal exploration sequence...
متن کاملAlogtime Algorithms for Tree Isomorphism, Comparison, and Canonization
The tree isomorphism problem is the problem of determining whether two trees are isomorphic. The tree canonization problem is the problem of producing a canonical tree isomorphic to a given tree. The tree comparison problem is the problem of determining whether one tree is less than a second tree in a natural ordering on trees. We present alternating logarithmic time algorithms for the tree iso...
متن کاملPreprint SCORES , INEQUALITIES AND REGULAR HYPERTOURNAMENTS
Abstract. A k -hypertournament is a complete k -hypergraph with each k -edge endowed with an orientation, that is, a linear arrangement of the vertices contained in the edge. In a k hypertournament, the score si (losing score ri ) of a vertex vi is the number of edges containing vi in which vi is not the last element (in which vi is the last element). In this paper we obtain inequalities involv...
متن کاملPancyclic out-arcs of a vertex in a hypertournament
A k-hypertournament H on n vertices, where 2 ≤ k ≤ n, is a pair H = (V,AH), where V is the vertex set of H and AH is a set of k-tuples of vertices, called arcs, such that for all subsets S ⊆ V of order k, AH contains exactly one permutation of S as an arc. Inspired by the successful extension of classical results for tournaments (i.e. 2-hypertournaments) to hypertournaments, by Gutin and Yeo [J...
متن کاملVertex-pancyclicity of hypertournaments
Abstract: A hypertournament or a k-tournament, on n vertices, 2≤k≤n, is a pair T= (V,E), where the vertex setV is a set of size n and the edge setE is the collection of all possible subsets of size k of V, called the edges, each taken in one of its k! possible permutations. A k-tournament is pancyclic if there exists (directed) cycles of all possible lengths; it is vertex-pancyclic if moreover ...
متن کامل